Exponential Polynomial Block Methods
نویسندگان
چکیده
In this paper we extend the polynomial time integration framework to include exponential for both partitioned and unpartitioned initial value problems. We then demonstrate utility o...
منابع مشابه
Block Toeplitz Methods in Polynomial Matrix Computations
Some block Toeplitz methods applied to polynomial matrices are reviewed. We focus on the computation of the structure (rank, null-space, infinite and finite structures) of an arbitrary rectangular polynomial matrix. We also introduce some applications of this structural information in control theory. All the methods outlined here are based on the computation of the null-spaces of suitable block...
متن کاملThe Polynomial - Exponential Equation
We solve the equation of the title for q = 3 and, partially, for q = 2. These are the only prime values of q for which there exist integer solutions. Our arguments are based upon off-diagonal Padé approximation to the binomial function.
متن کاملSparse Polynomial Exponential Sums
(1.2) f(x) = a1x k1 + · · ·+ arx with 0 < k1 < k2 < · · · < kr. We assume always that the content of f , (a1, a2, . . . , ar), is relatively prime to the modulus q. Let d = d(f) = kr denote the degree of f and for any prime p let dp(f) denote the degree of f read modulo p. A fundamental problem is to determine whether there exists an absolute constant C such that for an arbitrary positive integ...
متن کاملCharacters of Exponential-polynomial Modules
One may construct, for any function on the integers, an irreducible module of level zero for affine sl(2), using the values of the function as structure constants. The modules constructed using exponential-polynomial functions parameterise the irreducible objects of the category Õ of Chari with finite-dimensional homogeneous components. In this work, an expression for the formal character of su...
متن کاملWeights in block iterative methods
In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2021
ISSN: ['1095-7197', '1064-8275']
DOI: https://doi.org/10.1137/20m1321346